Discrete Mathematics
Q82.
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.Q83.
The conic section that is obtained when a right circular cone is cut through a plane that is parallel to the side of the cone is called _____Q85.
An ordered n-tuple (d_{1}, d_{2} ,... , d_{n}) with d_{1}\geq d_{2} \geq ... \geq d_{n} is called graphic if there exists a simple undirected graph with n vertices having degrees d_{1}, d_{2} ,... , d_{n} respectively. Which of the following 6-tuples is NOT graphic?Q87.
What is the cyclomatic complexity of a module which has seventeen edges and thirteen nodes?Q88.
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even.Q89.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?Q90.
Let G be a group of order 6, and H be a subgroup of G such that 1 < |H| < 6. Which one of the following options is correct?